Reentrant phase transitions and defensive alliances in social dilemmas with informed strategies
نویسندگان
چکیده
منابع مشابه
Reentrant phase transitions and defensive alliances in social dilemmas with informed strategies
Knowing the strategy of an opponent in a competitive environment conveys obvious evolutionary advantages. But this information is costly, and the benefit of being informed may not necessarily offset the additional cost. Here we introduce social dilemmas with informed strategies, and we show that this gives rise to two cyclically dominant triplets that form defensive alliances. The stability of ...
متن کاملReentrant phase transitions of DNA-surfactant complexes.
Complexes of double-stranded DNA with the cationic surfactant cetyltrimethylammonium bromide have been studied using small angle x-ray diffraction at varying concentrations of DNA and the cosurfactant hexanol. At low DNA concentrations, an intercalated hexagonal (H(c)(I))-->lamellar (L(c)(alpha))-->inverted hexagonal (H(c)(II)) transformation is found on increasing hexanol content. The H(c)(II)...
متن کاملGlobal Defensive Alliances in Graphs
A defensive alliance in a graph G = (V,E) is a set of vertices S ⊆ V satisfying the condition that for every vertex v ∈ S, the number of neighbors v has in S plus one (counting v) is at least as large as the number of neighbors it has in V − S. Because of such an alliance, the vertices in S, agreeing to mutually support each other, have the strength of numbers to be able to defend themselves fr...
متن کاملDefensive k-alliances in graphs
Let Γ = (V,E) be a simple graph of order n and degree sequence δ1 ≥ δ2 ≥ · · · ≥ δn. For a nonempty set X ⊆ V , and a vertex v ∈ V , δX(v) denotes the number of neighbors v has in X. A nonempty set S ⊆ V is a defensive k-alliance in Γ = (V,E) if δS(v) ≥ δS̄(v) + k, ∀v ∈ S. The defensive k-alliance number of Γ, denoted by ak(Γ), is defined as the minimum cardinality of a defensive k-alliance in Γ...
متن کاملExact Defensive Alliances in Graphs
A nonempty set S ⊂ V is a defensive k-alliance in G = (V,E), k ∈ [−Δ,Δ] ∪ Z, if for every v ∈ S, dS(v) ≥ dS̄(v) + k. A defensive k-alliance S is called exact, if S is defensive k-alliance but is no defensive (k+1)-alliance in G. In this paper we study the mathematical properties of exact defensive k-alliances in graphs. In particular, we obtain several bounds for defensive k-alliance of a graph....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2015
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/110/38003